0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E %s %d THM 0.13/0.35 % Computer : n003.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Aug 9 04:15:36 EDT 2022 0.13/0.35 % CPUTime : 0.20/0.48 Running higher-order on 8 cores theorem proving 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.48 # Version: 3.0pre003-ho 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.49 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.49 # Starting post_as_ho1 with 120s (1) cores 0.20/0.49 # almost_fo_3_lam with pid 4456 completed with status 0 0.20/0.49 # Result found by almost_fo_3_lam 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.49 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNF-FFSM00-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.49 # Starting new_ho_10 with 65s (1) cores 0.20/0.49 # new_ho_10 with pid 4461 completed with status 0 0.20/0.49 # Result found by new_ho_10 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.49 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNF-FFSM00-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.49 # Starting new_ho_10 with 65s (1) cores 0.20/0.49 # Preprocessing time : 0.001 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_22, type, meq_ind: mu > mu > $i > $o). 0.20/0.49 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.49 thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.49 thf(decl_35, type, mtrue: $i > $o). 0.20/0.49 thf(decl_36, type, mfalse: $i > $o). 0.20/0.49 thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_39, type, mreflexive: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_40, type, msymmetric: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_41, type, mserial: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_42, type, mtransitive: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_43, type, meuclidean: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_45, type, mfunctional: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_49, type, mvalid: ($i > $o) > $o). 0.20/0.49 thf(decl_50, type, minvalid: ($i > $o) > $o). 0.20/0.49 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.20/0.49 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.20/0.49 thf(decl_53, type, rel_s4: $i > $i > $o). 0.20/0.49 thf(decl_54, type, mbox_s4: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_55, type, mdia_s4: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_56, type, p: $i > $o). 0.20/0.49 thf(decl_57, type, q: $i > $o). 0.20/0.49 thf(decl_58, type, r: $i > $o). 0.20/0.49 thf(decl_59, type, esk1_0: $i). 0.20/0.49 thf(decl_60, type, esk2_0: $i). 0.20/0.49 thf(decl_61, type, esk3_0: $i). 0.20/0.49 thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mand)). 0.20/0.49 thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)). 0.20/0.49 thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)). 0.20/0.49 thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.20/0.49 thf(mdia_s4, axiom, ((mdia_s4)=(^[X6:$i > $o]:(mnot @ (mbox_s4 @ (mnot @ X6))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mdia_s4)). 0.20/0.49 thf(mbox_s4, axiom, ((mbox_s4)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_s4 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.20/0.49 thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.20/0.49 thf(prove, conjecture, (mvalid @ (mimplies @ (mor @ (mdia_s4 @ (mand @ p @ q)) @ (mdia_s4 @ (mand @ p @ r))) @ (mdia_s4 @ p))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)). 0.20/0.49 thf(c_0_8, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.20/0.49 thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.20/0.49 thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.20/0.49 thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.20/0.49 thf(c_0_12, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s4 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(fof_simplification,[status(thm)],[mdia_s4])). 0.20/0.49 thf(c_0_13, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_s4 @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.20/0.49 thf(c_0_14, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.20/0.49 thf(c_0_15, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_9]), c_0_10])). 0.20/0.49 thf(c_0_16, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.20/0.49 thf(c_0_17, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s4 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_9]), c_0_13])). 0.20/0.49 thf(c_0_18, negated_conjecture, ~(![X29:$i]:((~((~(![X26:$i]:((~(rel_s4 @ X29 @ X26)|~(~((~(p @ X26)|~(q @ X26)))))))|~(![X27:$i]:((~(rel_s4 @ X29 @ X27)|~(~((~(p @ X27)|~(r @ X27)))))))))|~(![X28:$i]:((~(rel_s4 @ X29 @ X28)|~(p @ X28))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_10]), c_0_14]), c_0_15]), c_0_16]), c_0_17])])). 0.20/0.49 thf(c_0_19, negated_conjecture, ![X37:$i]:((((((rel_s4 @ esk1_0 @ esk3_0)|(rel_s4 @ esk1_0 @ esk2_0))&(((p @ esk3_0)|(rel_s4 @ esk1_0 @ esk2_0))&((r @ esk3_0)|(rel_s4 @ esk1_0 @ esk2_0))))&((((rel_s4 @ esk1_0 @ esk3_0)|(p @ esk2_0))&(((p @ esk3_0)|(p @ esk2_0))&((r @ esk3_0)|(p @ esk2_0))))&(((rel_s4 @ esk1_0 @ esk3_0)|(q @ esk2_0))&(((p @ esk3_0)|(q @ esk2_0))&((r @ esk3_0)|(q @ esk2_0))))))&(~(rel_s4 @ esk1_0 @ X37)|~(p @ X37)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])). 0.20/0.49 thf(c_0_20, negated_conjecture, ![X3:$i]:((~((rel_s4 @ esk1_0 @ X3))|~((p @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])). 0.20/0.49 thf(c_0_21, negated_conjecture, ((rel_s4 @ esk1_0 @ esk3_0)|(p @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])). 0.20/0.49 thf(c_0_22, negated_conjecture, ((p @ esk3_0)|(p @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])). 0.20/0.49 thf(c_0_23, negated_conjecture, ((p @ esk3_0)|(rel_s4 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])). 0.20/0.49 thf(c_0_24, negated_conjecture, (p @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])). 0.20/0.49 thf(c_0_25, negated_conjecture, ((rel_s4 @ esk1_0 @ esk3_0)|(rel_s4 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])). 0.20/0.49 thf(c_0_26, negated_conjecture, (p @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_23]), c_0_24])])). 0.20/0.49 thf(c_0_27, negated_conjecture, (rel_s4 @ esk1_0 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_25]), c_0_26])])). 0.20/0.49 thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_27]), c_0_24])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 74 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 50 0.20/0.49 # Removed in clause preprocessing : 38 0.20/0.49 # Initial clauses in saturation : 12 0.20/0.49 # Processed clauses : 29 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 0 0.20/0.49 # ...remaining for further processing : 29 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 0 0.20/0.49 # Backward-rewritten : 8 0.20/0.49 # Generated clauses : 10 0.20/0.49 # ...of the previous two non-redundant : 8 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 1 0.20/0.49 # Paramodulations : 10 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 9 0.20/0.49 # Positive orientable unit clauses : 5 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 1 0.20/0.49 # Non-unit-clauses : 3 0.20/0.49 # Current number of unprocessed clauses: 2 0.20/0.49 # ...number of literals in the above : 6 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 20 0.20/0.49 # Clause-clause subsumption calls (NU) : 7 0.20/0.49 # Rec. Clause-clause subsumption calls : 7 0.20/0.49 # Non-unit clause-clause subsumptions : 1 0.20/0.49 # Unit Clause-clause subsumption calls : 12 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 8 0.20/0.49 # BW rewrite match successes : 4 0.20/0.49 # Condensation attempts : 29 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 2688 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.005 s 0.20/0.49 # System time : 0.003 s 0.20/0.49 # Total time : 0.008 s 0.20/0.49 # Maximum resident set size: 1920 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.008 s 0.20/0.49 # System time : 0.004 s 0.20/0.49 # Total time : 0.012 s 0.20/0.49 # Maximum resident set size: 1800 pages 0.20/0.49 EOF